Innnite-valued Logic Based on Two-valued Logic and Probability Part 1.4. the Tee Model for Grades of Membership
نویسنده
چکیده
This paper precisates the meaning of numerical membership values and shows that there is no contradiction between a probabilistic interpretation of grades of membership on the one hand, and membership functions of the attribute universe whose ordinates add up to more than 1 on the other. The membership value in a class , e.g., =tall, assigned by a subject to an object of a given attribute value u ex (e.g., u ex =exact height value) is interpreted as the subject's estimate of P(ju ex) , the probability that this object would be assigned (by herself or another subject) the label in the presence of fuzziness #1, 2 or 3 (in an experimental or natural language LB (labeling) or YN (yes-no) situation in which the subject uses a nonfuzzy threshold criterion in the universe U of estimated attribute values). = l is assumed to be an element of a label set , such as = fsmall, medium, tallg. The probabilistic`summing up to 1 requirement' applies to the sum of P(l ju ex) = l (u ex) over the elements l of. In`traditional' fuzzy set theory, this requirement is expressed by the formula for the negation, NOT (u ex) + (u ex) = 1 8u ex , as well as by the `summing up to 1' requirement (of the grades of membership of a given point u ex in all clusters) used by fuzzy clustering algorithms. The shapes of the P(l ju ex) = l (u ex) membership curves are derived in the TEE model, and are contrasted with the shapes of the P(u ex j l) probability curves for which thèsumming up to 1 over u ex ' holds. The signiicance of the membership values 0, 0.5 and 1, as well as the meaning of a `subnormal fuzzy set', of the probability of a fuzzy event and of the possibility/probability consistency factor are precisated. Zadeh's postulated formulas for the last two quantities are derived and connrmed. Entropy expressions connected with fuzzy subsets are derived. The complementation paradox of fuzzy set theory is shown to disappear when the postulated max operator for OR is replaced by the operators derived from the TEE model.
منابع مشابه
In nite-Valued Logic Based on Two-Valued Logic and Probability Part 1.4. The TEE Model for Grades of Membership
This paper precisates the meaning of numerical membership values and shows that there is no contradiction between a probabilistic interpretation of grades of membership on the one hand, and membership functions of the attribute universe whose ordinates add up to more than 1 on the other. The membership value in a class , e.g., =tall, assigned by a subject to an object of a given attribute value...
متن کاملTREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کاملInnnite-valued Logic Based on Two-valued Logic and Probability Part 1.3. Reference Experiments and Label Sets Figures and Contents of Innnite-valued Logic Based on Two-valued Logic and Probability Part 1.3. Reference Experiments and Label Sets
The TEE model for grades of membership claims that there is a connection between the fact that an object is labeled (e.g., =old) in a natural language discourse on the one hand; and the assignment to the object of a high grade of membership in on the other. In preparation for a more precise formulation of this assertion we deene here 1) LB (labeling) and 2) YN (yes-no) experiments which simulat...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کامل